A Lemma which Distinguishes Minimal Logics from Other Logics
نویسندگان
چکیده
منابع مشابه
EQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملMinimal models in propositional logics: approximation results
In this work we deene optimization problems concerning different notions of models. In particular, we analyze the diierent settings of two, three and four-valued propositional logic: in each setting we focus on the problem of minimizing the number of literals belonging to a model or maximizing the number of literals that do not belong to a model of a CNF formula. First, we formulate these probl...
متن کاملMinimal Knowledge States in Nonmonotonic Modal Logics
Recent studies on the computational properties of the logic of minimal knowledge states due to Halpern and Moses (also known as ground logic S5 G) have shown that reasoning in this logic is strictly harder than in all the most studied propositional non-monotonic formalisms, in particular with respect to nonmonotonic modal logics due to McDermott and Doyle. In this paper we show that the logic o...
متن کاملLogics from Quantum Computation
The theory of logical gates in quantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence is identified with a quregister (a system of qubits) or, more generally, with a mixture of quregisters (called qumix). In this framework, any sentence α of the language gives rise to a quantum tree: ...
متن کاملJustification logics and hybrid logics
Hybrid logics internalize their own semantics. Members of the newer family of justification logics internalize their own proof methodology. It is an appealing goal to combine these two ideas into a single system, and in this paper we make a start. We present a hybrid/justification version of the modal logic T. We give a semantics, a proof theory, and prove a completeness theorem. In addition, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nagoya Mathematical Journal
سال: 1966
ISSN: 0027-7630,2152-6842
DOI: 10.1017/s0027763000024041